Computing Delaunay Triangulation with Imprecise Input Data
نویسندگان
چکیده
The key step in the construction of the Delaunay triangulation of a finite set of planar points is to establish correctly whether a given point of this set is inside or outside the circle determined by any other three points. We address the problem of formulating the in-circle test when the coordinates of the planar points are given only up to a given precision, which is usually the case in practice. By modelling imprecise points as rectangles, and using the idea of partial disc, we construct a reliable in-circle test that provides the best possible Delaunay triangulation with the imprecise input data given by rectangles. keywords: robust algorithm, Delaunay triangulation, imprecise data, in-circle test, partial disc.
منابع مشابه
Computability of Partial Delaunay Triangulation and Voronoi Diagram [ Extended
Using the domain-theoretic model for geometric computation, we define the partial Delaunay triangulation and the partial Voronoi diagram of N partial points in R2 and show that these operations are domain-theoretically computable and effectively computable with respect to Hausdorff distance and Lebesgue measure. These results are obtained by showing that the map which sends three partial points...
متن کاملDelaunay Triangulation of Imprecise Points Simplified and Extended
Suppose we want to compute the Delaunay triangulation of a set P whose points are restricted to a collectionR of input regions known in advance. Building on recent work by Löffler and Snoeyink [21], we show how to leverage our knowledge of R for faster Delaunay computation. Our approach needs no fancy machinery and optimally handles a wide variety of inputs, eg, overlapping disks of different s...
متن کاملBasic algorithms in computational geometry with imprecise input
The domain-theoretic model of computational geometry provides us with continuous and computable predicates and binary operations. It can also be used to generalise the theory of computability for real numbers and real functions into geometric objects and geometric operations. A geometric object is computable if it is the effective limit of a sequence of finitary partial objects of the same type...
متن کاملDelaunay Triangulation of Imprecise Points, Preprocess and Actually Get a Fast Query Time
We propose a new algorithm that preprocess a set of n disjoint unit disks to be able to compute the Delaunay triangulation in O(n) expected time. Conversely to previous similar results, our algorithm is actually faster than a direct computation in O(n log n) time. Key-words: Delaunay triangulation, uncertainties, randomization This work is partly supported by ANR grant Triangles (ANR-07-BLAN-03...
متن کاملA Robust Intersection Algorithm Based on Delaunay Triangulation
The paper presents a new robust method for finding points of intersection of line segments in the plane. In this method the subdivision of the plane based on the Delaunay triangulation plays the main role. First, the Delaunay triangulation spanning the end points of line segments is constructed. Next, for line segments that are not realized by Delaunay edges, midpoints are inserted recursively ...
متن کامل